A precongruence format for should testing preorder

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A precongruence format for should testing preorder

Should testing preorder was proposed as a liveness-preserving precongruence for a process algebra except for nondeterministic choice operator [22]. However, this precongruce result cannot be generalized to other languages before carefully proved. In this paper, we show that τDes format is a precongruence format for should testing preorder. A precongruence format guarantees the precongruence of ...

متن کامل

Language preorder as a precongruence

Groote and Vaandrager introduced the tyft format, which is a congruence format for strong bisimulation equivalence. This article proposes additional syntactic requirements on the tyft format, extended with predicates, to obtain a precongruence format for language preorder.

متن کامل

A Preorder Relation for Markov Reward Processes

A new preorder relation is introduced that orders states of a Markov process with an additional reward structure according to the reward gained over any interval of finite or infinite length. The relation allows the comparison of different Markov processes and includes as special cases monotone and lumpable Markov processes.

متن کامل

A Fully Abstract Denotational Model for Observational Precongruence

A domain theoretical denotational model is given for a simple sublan-guage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence.

متن کامل

Precongruence Formats for Decorated Trace Preorders

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin’s structural approach. For several preorders in the linear time – branching time spectrum a format is given, as general as possible, such that this preorder is a precon...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Logic and Algebraic Programming

سال: 2010

ISSN: 1567-8326

DOI: 10.1016/j.jlap.2010.03.001